Quantum-Behaved Particle Swarm Optimization with Chaotic Search
نویسندگان
چکیده
منابع مشابه
Improved Quantum-Behaved Particle Swarm Optimization
To enhance the performance of quantum-behaved PSO, some improvements are proposed. First, an encoding method based on the Bloch sphere is presented. In this method, each particle carries three groups of Bloch coordinates of qubits, and these coordinates are actually the approximate solutions. The particles are updated by rotating qubits about an axis on the Bloch sphere, which can simultaneousl...
متن کاملStreamflow forecasting by SVM with quantum behaved particle swarm optimization
Accurate forecasting of streamflows has been one of the most important issues as it plays a key role in allotment of water resources. However, the information of streamflow presents a challenging situation; the streamflow forecasting involves a rather complex nonlinear data pattern. In the recent years, the support vector machine has been used widely to solve nonlinear regression and time serie...
متن کاملMicrosoft Word - Quantum-behaved Particle Swarm Optimization With Elitist ..
Quantum-behaved Particle Swarm Optimization (QPSO) algorithm is a global convergence guaranteed algorithms, which outperforms traditional PSOs in search ability as well as having fewer parameters to control. In this paper, in order to depict the thinking model of people accurately that the decision-making is always influenced by the important part factors which we called elitist, so elitist mea...
متن کاملA Chaotic Quantum Behaved Particle Swarm Optimization Algorithm for Short-term Hydrothermal Scheduling
Abstract: This study proposes a novel chaotic quantum-behaved particle swarm optimization (CQPSO) algorithm for solving shortterm hydrothermal scheduling problem with a set of equality and inequality constraints. In the proposed method, chaotic local search technique is employed to enhance the local search capability and convergence rate of the algorithm. In addition, a novel constraint handlin...
متن کاملCooperative Quantum-Behaved Particle Swarm Optimization with Dynamic Varying Search Areas and Lévy Flight Disturbance
This paper proposes a novel variant of cooperative quantum-behaved particle swarm optimization (CQPSO) algorithm with two mechanisms to reduce the search space and avoid the stagnation, called CQPSO-DVSA-LFD. One mechanism is called Dynamic Varying Search Area (DVSA), which takes charge of limiting the ranges of particles' activity into a reduced area. On the other hand, in order to escape the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEICE Transactions on Information and Systems
سال: 2008
ISSN: 0916-8532,1745-1361
DOI: 10.1093/ietisy/e91-d.7.1963